Almost sure behavior of linear functionals of supercritical branching processes
نویسندگان
چکیده
منابع مشابه
Almost multiplicative linear functionals and approximate spectrum
We define a new type of spectrum, called δ-approximate spectrum, of an element a in a complex unital Banach algebra A and show that the δ-approximate spectrum σ_δ (a) of a is compact. The relation between the δ-approximate spectrum and the usual spectrum is investigated. Also an analogue of the classical Gleason-Kahane-Zelazko theorem is established: For each ε>0, there is δ>0 such that if ϕ is...
متن کاملA strong law of large numbers for branching processes: almost sure spine events
We demonstrate a novel strong law of large numbers for branching processes, with a simple proof via measure-theoretic manipulations and spine theory. Roughly speaking, any sequence of events that eventually occurs almost surely for the spine entails the almost sure convergence of a certain sum over particles in the population.
متن کاملGenealogy for Supercritical Branching Processes
We study the genealogy of so-called immortal branching processes, i.e. branching processes where each individual upon death is replaced by at least one new individual, and conclude that their marginal distributions are compound geometric. The result also implies that the limiting distributions of properly scaled supercritical branching processes are compound geometric. We exemplify our results ...
متن کاملalmost multiplicative linear functionals and approximate spectrum
we define a new type of spectrum, called δ-approximate spectrum, of an element a in a complex unital banach algebra a and show that the δ-approximate spectrum σ_δ (a) of a is compact. the relation between the δ-approximate spectrum and the usual spectrum is investigated. also an analogue of the classical gleason-kahane-zelazko theorem is established: for each ε>0, there is δ>0 such that if ϕ is...
متن کاملAlmost Sure Bisimulation in Labelled Markov Processes
In this paper we propose a notion of bisimulation for labelled Markov processes parameterised by negligible sets (LMPns). The point is to allow us to say things like two LMPs are “almost surely” bisimilar when they are bisimilar everywhere except on a negligible set. Usually negligible sets are sets of measure 0, but we work with abstract ideals of negligible sets and so do not introduce an ad-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1977
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1977-0440719-1